On the general sum-connectivity index and general Randić index of cacti
نویسندگان
چکیده
*Correspondence: [email protected] 1School of Natural Sciences (SNS), National University of Sciences and Technology (NUST), Sector H-12, Islamabad, Pakistan 2Department of Mathematical Sciences, United Arab Emirates University, P.O. Box 15551, Al Ain, United Arab Emirates Full list of author information is available at the end of the article Abstract Let G be a connected graph. The degree of a vertex x of G, denoted by dG(x), is the number of edges adjacent to x. The general sum-connectivity index is the sum of the weights (dG(x) + dG(y)) for all edges xy of G, where α is a real number. The general Randić index is the sum of weights of (dG(x)dG(y)) for all edges xy of G, where α is a real number. The graph G is a cactus if each block of G is either a cycle or an edge. In this paper, we find sharp lower bounds on the general sum-connectivity index and general Randić index of cacti.
منابع مشابه
A Note on the ZerothOrder General Randić Index of Cacti and Polyomino Chains
The present note is devoted to establish some extremal results for the zerothorder general Randić index of cacti, characterize the extremal polyomino chains with respect to the aforementioned index, and hence to generalize two already reported results.
متن کاملOn generalized atom-bond connectivity index of cacti
The generalized atom-bond connectivity index of a graph G is denoted by ABCa(G) and defined as the sum of weights ((d(u)+d(v)-2)/d(u)d(v))aa$ over all edges uv∊G. A cactus is a graph in which any two cycles have at most one common vertex. In this paper, we compute sharp bounds for ABCa index for cacti of order $n$ ...
متن کاملA note on polyomino chains with extremum general sum-connectivity index
The general sum-connectivity index of a graph $G$ is defined as $chi_{alpha}(G)= sum_{uvin E(G)} (d_u + d_{v})^{alpha}$ where $d_{u}$ is degree of the vertex $uin V(G)$, $alpha$ is a real number different from $0$ and $uv$ is the edge connecting the vertices $u,v$. In this note, the problem of characterizing the graphs having extremum $chi_{alpha}$ values from a certain collection of polyomino ...
متن کاملOn the Randić index of cacti
The Randić index of an organic molecule whose molecular graph is G is the sum of the weights (d(u)d(v))− 1 2 of all edges uv of G, where d(u) and d(v) are the degrees of the vertices u and v in G. In the paper, we give a sharp lower bound on the Randić index of cacti.
متن کامل